منابع مشابه
Embedding problems of division algebras
A finite group G is called admissible over a given field if there exists a central division algebra that contains a G-Galois field extension as a maximal subfield. We give a definition of embedding problems of division algebras that extends both the notion of embedding problems of fields as in classical Galois theory, and the question which finite groups are admissible over a field. In a recent...
متن کاملEmbedding Problems and Finite Quotients
We give a condition on a family of solutions of quotients of an embedding problem which implies the embedding problem has a solution. This shows, in particular, that to solve an embedding problem associated to the maximal extension of a number field unramified outside a fixed finite set of places, it suffices to find a solution for each finite quotient of the embedding problem. This statement i...
متن کاملImproved Lower Bounds for Graph Embedding Problems
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector Crafting, and show that these cannot be solved in time 2o(|s|/ log |s|), unless the Exponential Time Hypothesis fails. These results are used to obtain simplified hardness results for several ...
متن کاملSubwords: automata, embedding problems, and verification
The increasing use of software and automated systems has made it important to ensure their correct behaviour. Bugs can not only have significant financial costs, but also catastrophic consequences in mission-critical systems. Testing against a variety of environments and inputs helps with discovering bugs, but cannot guarantee their absence. Formal verification is the technique that establishes...
متن کاملGalois Embedding Problems with Cyclic Quotient
Let K be a cyclic Galois extension of degree p over a field F containing a primitive pth root of unity. We consider Galois embedding problems involving Galois groups with common quotient Gal(K/F ) such that corresponding normal subgroups are indecomposable Fp[Gal(K/F )]modules. For these embedding problems we prove conditions on solvability, formulas for explicit construction, and results on au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2000
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-00-02625-8